Design and Implementation of Closed Loop Efficient Routing with Distance Optimization in Optical Networks

This paper proposes an efficient closed loop routing in optical networks. It also proposes distance optimization by genetic approach subject to requirements of fairness, efficiency, and cost. It proposes a network design problem for the traffic grooming and routing in WDM networks. Moreover, effective ways to improve its performance and reduce its complexity are provided. In this work, it is concentrated on the effects of bandwidth, delay and bit error rate. This work deliberates the development in blocking probably for incoming requests while performing routing by proposed algorithm and shortest path algorithm. Used prior to network operation, the algorithm determines which route should be used for each potential connection. Moreover, since the routes provided by the genetic algorithm are stored in routing tables, it also ensures extremely fast on-line network operation. Shortest path can be calculated for any number of nodes. A number of important parameters like transmission distance, noise power, optical signal to noise ratio, channel load, bit error rate and packet delay have been calculated. The proposed algorithm is a dynamic algorithm and in it is easy to exploit present and alternate solution, each time a fittest path is calculated. Index Terms – closed loop Routing, distance optimization, shortest path, Blocking Probability.